Set Theory INC# ∞# Based on Infinitary Intuitionistic Logic with Restricted Modus Ponens Rule (Part.II) Hyper Inductive Definitions
نویسندگان
چکیده
In this paper intuitionistic set theory INC# ∞# in infinitary theoretical language is considered. External induction principle nonstandard arithmetic were derived. Non trivial application number considered.The Goldbach-Euler theorem obtained without anyreferences to Catalan conjecture.
منابع مشابه
Naive Modus Ponens
In his [2011], Lionel Shapiro proposes a very interesting deflationist conception of logical consequence, according to which the logical-consequence predicate applying to sentences serves as a merely expressive device allowing us to talk in a generalising way about typically non-linguistic entailment facts (just as, according to a deflationist conception of truth, the truth predicate applying t...
متن کاملOn the joint verification of Modus Ponens and Modus Tollens in fuzzy logic
This paper deals with the joint verification of the inequalities of Modus Ponens and Modus Tollens in Fuzzy Logic. Although the case of Modus Ponens was partially considered before, the case of Modus Tollens and the joint satisfaction of both inequalities are studied by the first time. The cases of R-implications, Simplications, Q-implications and MamdaniLarsen implications are separatedly cons...
متن کاملLocal Constructive Set Theory and Inductive Definitions
Local Constructive Set Theory (LCST) is intended to be a local version of constructive set theory (CST). Constructive Set Theory is an open-ended set theoretical setting for constructive mathematics that is not committed to any particular brand of constructive mathematics and, by avoiding any built-in choice principles, is also acceptable in topos mathematics, the mathematics that can be carrie...
متن کاملGeneralized Inductive Definitions in Constructive Set Theory
The intent of this paper is to study generalized inductive definitions on the basis of Constructive Zermelo-Fraenkel Set Theory, CZF. In theories such as classical ZermeloFraenkel Set Theory, it can be shown that every inductive definition over a set gives rise to a least and a greatest fixed point, which are sets. This principle, notated GID, can also be deduced from CZF plus the full impredic...
متن کاملAutomating Program Proofs Based on Separation Logic with Inductive Definitions
This paper investigates the use of Separation Logic with inductive definitions in reasoning about programs that manipulate dynamic data structures. We propose a novel approach for exploiting the inductive definitions in automating program proofs based on inductive invariants. We focus on iterative programs, although our techniques apply to recursive programs as well, and specifications that des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of advances in mathematics and computer science
سال: 2021
ISSN: ['2456-9968']
DOI: https://doi.org/10.9734/jamcs/2021/v36i430359